Finite Number Sums in Higher Order Powers of Harmonic Numbers (communicated by Toufik Mansour)
نویسنده
چکیده
منابع مشابه
Harmonic Numbers and Cubed Binomial Coefficients
Anthony Sofo Victoria University College, Victoria University, P.O. Box 14428, Melbourne City, VIC 8001, Australia Correspondence should be addressed to Anthony Sofo, [email protected] Received 18 January 2011; Accepted 3 April 2011 Academic Editor: Toufik Mansour Copyright q 2011 Anthony Sofo. This is an open access article distributed under the Creative Commons Attribution License, which...
متن کاملA NOTE ON SUM OF k-TH POWER OF HORADAM’S SEQUENCE
(1) wn+2 = pwn+1 + qwn, with given w0 = a,w1 = b and n ≥ 0. This sequence was introduced, in 1965, by Horadam [Ho], and it generalizes many sequences (see [HW, HM]). Examples of such sequences are Fibonacci numbers sequence (Fn)n≥0, Lucas numbers sequence (Ln)n≥0, and Pell numbers sequence (Pn)n≥0, when one has p = q = b = 1, a = 0; p = q = b = 1, a = 2; and p = 2, q = b = 1, a = 0; respectivel...
متن کاملA formula for the generating functions of powers of Horadam's sequence
The second-order linear recurrence sequence (wn(a, b; p, q))n≥0, or briefly (wn)n≥0, is defined by wn+2 = pwn+1 + qwn, (1) with w0 = a, w1 = b and n ≥ 0. This sequence was introduced in 1965 by Horadam [3, 4], and it generalizes many sequences (see [1, 5]). Examples of such sequences are Fibonacci number sequences (Fn)n≥0, Lucas number sequences (Ln)n≥0, and Pell number sequences (Pn)n≥0, when ...
متن کاملHarmonic Sums and Mellin Transforms
with n0 ≡ N. The finite harmonic sums form classes which are given by their transcendentality t = ∑m l=1 |kl|. This term was chosen to characterize the behavior of these sums for N → ∞. In this case the values of the sums, if existing, are described by a transcendental number of rank t, i.e. log 2, ζ(2), ζ(3) or log 2·ζ(2), etc. for t = 1, 2, 3, ... All harmonic sums have a linear representatio...
متن کاملCounting Occurrences of Some Subword Patterns Alexander Burstein and Toufik Mansour
We find generating functions for the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.
متن کامل